Edge-dominating cycles, k-walks and Hamilton prisms in 2K22K_2-free graphs

We show that an edge-dominating cycle in a $2K_2$-free graph can be found in polynomial time; this implies that every 1/(k-1)-tough $2K_2$-free graph admits a k-walk, and it can be found in polynomial time. For this class of graphs, this proves a long-standing conjecture due to Jackson and Wormald (1990). Furthermore, we prove that for any \epsilon>0 every (1+\epsilon)-tough $2K_2$-free graph is prism-Hamiltonian and give an effective construction of a Hamiltonian cycle in the corresponding prism, along with few other similar results.Comment: LaTeX, 8 page

The homogeneous pseudo-embeddings and hyperovals of the generalized quadrangle H(3,4)

In this paper, we determine all homogeneous pseudo-embeddings of the generalized quadrangle H(3, 4) and give a description of all its even sets. Using this description, we subsequently compute all hyperovals of H(3, 4), up to isomorphism, and give computer free descriptions of them. Several of these hyperovals, but not all of them, have already been described before in the literature. (C) 2020 Elsevier Inc. All rights reserved

On four codes with automorphism group P Sigma L(3,4) and pseudo-embeddings of the large Witt designs

A pseudo-embedding of a point-line geometry is a representation of the geometry into a projective space over the field F-2 such that every line corresponds to a frame of a subspace. Such a representation is called homogeneous if every automorphism of the geometry lifts to an automorphism of the projective space. In this paper, we determine all homogeneous pseudo-embeddings of the three Witt designs that arise by extending the projective plane PG(2, 4). Along our way, we come across some codes with automorphism group P Sigma L(3, 4) and sets of points of PG(2, 4) that have a particular intersection pattern with Baer subplanes or hyperovals